Distance distribution of nodes in star graphs
نویسندگان
چکیده
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number of nodes at a distance k from the identity node in a star graph where k varies from 0 to the diameter of the graph. A star graph is a Cayley graph like the hypercubes; for a hypercube Qn, there are exactly ` n r ́ nodes at a distance r from the identity node where r varies from 0 to n.
منابع مشابه
Application of n-distance balanced graphs in distributing management and finding optimal logistical hubs
Optimization and reduction of costs in management of distribution and transportation of commodity are one of the main goals of many organizations. Using suitable models in supply chain in order to increase efficiency and appropriate location for support centers in logistical networks is highly important for planners and managers. Graph modeling can be used to analyze these problems and many oth...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملStar graphs: E-sets and threaded distance trees
The distribution of distances in star graphs is established with the aim of obtaining a threaded rooted tree with levels given by the distances to the identity permutation, produced via pruning and threading algorithms. In the process, the distributions of distances of the efficient dominating sets (or E-sets) of the star graphs are determined.
متن کاملFault-Tolerant Routing on the Star Graph with Safety Vectors
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes. However, the distance measure cannot be applied on star graphs directly, since there are many routing path patterns when the distances of two pairs of nodes are the same. Thus, on star graphs, we define the safety ve...
متن کاملAn Optimal Symmetric Secret Distribution of Star Networks1
In this paper, we focus on the problem of key distribution that permits local broadcast authentication. We focus on four types of graphs (1) star graphs, (2) bipartite graphs, (3) planer graphs and (4) fully connected graphs. For star graphs, we show that as n, the number of satellite nodes in the star network, tends to ∞, it suffices to maintain log n + 1/2 log log n + 1 secrets at the center ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 19 شماره
صفحات -
تاریخ انتشار 2006